Creating a Giant Component

Creating a Giant Component

Let c be a constant and (e1, f1), (e2, f2), . . . , (ecn, fcn) be a sequence of ordered pairs of edges on vertex set [n] chosen uniformly and independently at random. Let A be an algorithm for the on-line choice of one edge from each presented pair, and for i = 1, . . . , cn let GA(i) be the graph on vertex set [n] consisting of the first i edges chosen by A. We prove that all algorithms in a c...

Avoiding a Giant Component

Avoiding a giant component

The Giant Component

But, we will consider a fancier approach to sampling that yields the same distribution. In particular, we will create a collection of independent random variables Xi,j for all i 6= j. This is twice as many variables as we need, so we will only use one from each pair (Xi,j , Xj,i). We will then choose pairs (i, j) in some order, choose only one of Xi,j or Xj,i to examine, and then use the variab...

Embracing the Giant Component

Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large as possible. This game is in the spirit of recent papers on avoiding a giant component, but here we embrace it. We analyze this game in the offline and online setting, for arbitrary and random instances, which provides...